Double commutative-step digraphs with minimum diameters
نویسندگان
چکیده
From a natural generalization to E* of the concept of congruence, it is possible to define a family of 2-regular digraphs that we call double commutative-step digraphs. They turn out to be Cayley diagrams of Abelian groups generated by two elements, and can be represented by L-shaped tiles which tessellate the plane periodically. A double commutative-step digraph with n vertices is said to be tight if its diameter attains the lower bound Ib(n)=r&l-2. In this paper, the tiles associated with tight double commutative-step digraphs are fully characterized. This allows us to construct such digraphs and also to find for which values of II they exist. In particular, we characterize a complete set of families of tight double fixed-step digraphs (also called circulant digraphs), generalizing some previously known results.
منابع مشابه
Discrete dynamics over double commutative-step digraphs
A double-loop digraph, G(N ; s1; s2), has the set of vertices V = ZN and the adjacencies are de0ned by i → i + sk (modN ), k = 1; 2 for any i ∈ V . Double commutative-step digraph generalizes the double-loop. A double commutative-step digraph can be represented by a L-shaped tile, which periodically tessellates the plane. This geometrical approach has been used in several works to optimize some...
متن کاملSufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs
Let D be a digraph with vertex set V(D) .For vertex v V(D), the degree of v, denoted by d(v), is defined as the minimum value if its out-degree and its in-degree . Now let D be a digraph with minimum degree and edge-connectivity If is real number, then the zeroth-order general Randic index is defined by . A digraph is maximally edge-connected if . In this paper we present sufficient condi...
متن کاملCommutative weakly distance-regular digraphs of girth 2
We introduce some constructions of weakly distance-regular digraphs of girth 2, and prove that a certain quotient digraph of a commutative weakly distance-transitive digraph of girth 2 is a distancetransitive graph. As an application of the result, we obtain some examples of weakly distanceregular digraphs which are not weakly distance-transitive. Moreover, a class of commutative weakly distanc...
متن کاملOn spectral radius of strongly connected digraphs
It is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. In this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.
متن کاملWeakly Distance-Regular Digraphs of Girth 2
In this paper, we give two constructions of weakly distance-regular digraphs of girth 2, and prove that certain quotient digraph of a commutative weakly distancetransitive digraph of girth 2 is a distance-transitive graph. As an application of the result, we not only give some constructions of weakly distance-regular digraphs which are not weakly distance-transitive, but determine a special cla...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 114 شماره
صفحات -
تاریخ انتشار 1993